Precise bounds for Stieltjes transforms and positive real functions
نویسندگان
چکیده
منابع مشابه
Stieltjes Transforms on New Generalized Functions
We introduce a Stieltjes transform on the equivalence classes of a new generalized function which has been successfully developed by Colombeau. Subsets of rapid descent test functions, (Rn), as well as tempered distributions, ′(Rn), are used to preserve Fourier analysis techniques. 2000 Mathematics Subject Classification. Primary 46F12.
متن کاملRepresentation of Functions as Absolutely Convergent Fourier-stieltjes Transforms
0. Introduction. Let G be a locally compact Abelian group, and G* its group of (continuous) characters. We write (y, x) to indicate the function on G*XG which is the value of the character y EG* at the point *6G, or, dually, the value of the character xEG at the point y EG*. Borel sets in G are taken to be the smallest cr-algebra of sets containing all closed sets. We consider the set of all re...
متن کاملReal-variables characterization of generalized Stieltjes functions
We obtain a characterization of generalized Stieltjes functions of any order λ > 0 in terms of inequalities for their derivatives on (0,∞). When λ = 1, this provides a new and simple proof of a characterization of Stieltjes functions first obtained by Widder in 1938.
متن کاملOn Positive Functions with Positive Fourier Transforms
Using the basis of Hermite–Fourier functions (i.e. the quantum oscillator eigenstates) and the Sturm theorem, we derive constraints for a function and its Fourier transform to be both real and positive. We propose a constructive method based on the algebra of Hermite polynomials. Applications are extended to the 2-dimensional case (i.e. Fourier–Bessel transforms and the algebra of Laguerre poly...
متن کاملGPU-based Real-time Discrete Euclidean Distance Transforms with Precise Error Bounds
We present a discrete distance transform in style of the vector propagation algorithm by Danielsson. Like other vector propagation algorithms, the proposed method is close to exact, i.e., the error can be strictly bounded from above and is significantly smaller than one pixel. Our contribution is that the algorithm runs entirely on consumer class graphics hardware, thereby achieving a throughpu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1963
ISSN: 0022-247X
DOI: 10.1016/0022-247x(63)90061-1